Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("DISTANCE MINIMALE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1059

  • Page / 43
Export

Selection :

  • and

ANOTHER LOOK AT FISHER'S SOLUTION TO THE PROBLEM OF THE WEIGHTED MEANCHAUBEY YP; GABOR G.1981; COMMUN. STAT., THEORY METHODS; ISSN 0361-0926; USA; DA. 1981; VOL. 10; NO 12; PP. 1225-1237; BIBL. 2 P.Article

ON THE MINIMUM EUCLIDEAN DISTANCE FOR A CLASS OF SIGNAL SPACE CODESAULIN T; SUNDBERG CE.1982; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 1; PP. 43-55; BIBL. 21 REF.Article

ON THE MINIMUM DISTANCE OF SOME BCH CODESCOHEN G.1980; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1980; VOL. 26; NO 3; PP. 363; BIBL. 5 REF.Article

DISTRIBUTIONS LIMITES DE LA DISTANCE SEPARANT DU PLUS PROCHE ANCETRE COMMUNZUBKOV AM.1975; TEOR. VEROJAT. PRIMEN.; S.S.S.R.; DA. 1975; VOL. 20; NO 3; PP. 614-623; ABS. ANGL.; BIBL. 7 REF.Article

FINDING THE MINIMUM DISTANCE BETWEEN TWO CONVEX POLYGONSSCHWARTZ JT.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 13; NO 4-5; PP. 168-170; BIBL. 2 REF.Article

MINIMUM DISTANCE ESTIMATION IN A LINEAR REGRESSION MODELKOUL H; DEWET T.1983; ANNALS OF STATISTICS; ISSN 0090-5364; USA; DA. 1983; VOL. 11; NO 3; PP. 921-932; BIBL. 19 REF.Article

MINIMUM DISTANCE ESTIMATORS FOR LOCATION AND GOODNESS OF FITBOOS DD.1981; J. AM. STAT. ASSOC.; ISSN 0003-1291; USA; DA. 1981; VOL. 76; NO 385; PP. 663-670; BIBL. 23 REF.Article

A NEW DESCRIPTION OF THE NADLER CODE = UNE NOUVELLE DESCRIPTION DU CODE DE NADLERVAN LINT JH.1972; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1972; VOL. 18; NO 6; PP. 825-826Serial Issue

ON MINIMUM CRAMER-VON MISES-NORM PARAMETER ESTIMATIONPARR WC; DE WET T.1981; COMMUN. STAT., THEORY METHODS; ISSN 0361-0926; USA; DA. 1981; VOL. 10; NO 12; PP. 1149-1166; BIBL. 13 REF.Article

ON A METHOD FOR ESTABLISHING THE MINIMUM DISTANCE OF ABELIAN CODESPETHO A; REMENYI G.1982; PROBL. CONTROL INF. THEORY; ISSN 0370-2529; HUN; DA. 1982; VOL. 11; NO 2; PP. 97-105; ABS. RUS; BIBL. 5 REF.Article

ON MINIMUM DISTANCE ESTIMATORS FOR UNIMODAL DENSITIES.REISS RD.1976; METRIKA; DTSCH; DA. 1976; VOL. 23; NO 1; PP. 7-14; BIBL. 9 REF.Article

GENERALIZED MINIMUM DISTANCE DECODING ON MAJORITY LOGIC DECODABLE CODESTAI YANG HWANG; SHENG UEI GUAN.1982; IEEE TRANS. INF. THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 5; PART. 1; PP. 790-792; BIBL. 9 REF.Article

NEAREST RANDOM VARIABLES WITH GIVEN DISTRIBUTIONS.SCHAY G.1974; ANN. PROBAB.; U.S.A.; DA. 1974; VOL. 2; NO 1; PP. 163-166; BIBL. 6 REF.Article

CASCADED DECODING WITH RESPECT TO MINIMAL GENERALIZED DISTANCEDUMER II; ZINOV'EV VA; ZYABLOV VV et al.1981; PROBL. CONTROL INF. THEORY; ISSN 0370-2529; HUN; DA. 1981; VOL. 10; NO 1; PP. 1.-17; BIBL. 7 REF.; IDEM RUSArticle

ON BOUNDS FOR CODES IN HAMMING SCHEMES AND JOHNSON SCHEMESDE VROEDT C.1980; DELFT PROG. REP.; ISSN 501115; NLD; DA. 1980; VOL. 5; NO 2; PP. 78-91; BIBL. 3 REF.Article

ANALYSIS OF THE COMPUTATIONAL AND STORAGE REQUIREMENTS FOR THE MINIMUM-DISTANCE DECODING OF CONVOLUTIONAL CODESNG WH; GOODMAN RMF.1979; PROC. INSTIT. ELECTR. ENGRS; GBR; DA. 1979; VOL. 126; NO 1; PP. 29-34; BIBL. 5 REF.Article

CONCATENATED CODES WITH LARGE MINIMUM DISTANCE.LIH JYH WENG.1977; I.E.E.E. TRANS. INFORM. THEORY; U.S.A.; DA. 1977; VOL. 23; NO 5; PP. 613-615; BIBL. 7 REF.Article

MINIMUM DISTANCE ESTIMATION: A BIBLIOGRAPHYPARR WC.1981; COMMUN. STAT., THEORY METHODS; ISSN 0361-0926; USA; DA. 1981; VOL. 10; NO 12; PP. 1205-1224; BIBL. 7 P.Article

ON MINIMUM DISTANCE ESTIMATION OF LOCATION BASED ON THE KOLMOGOROV STATISTICLITTELL RC; RAO PV.1982; COMMUNICATIONS IN STATISTICS. THEORY AND METHODS; ISSN 0361-0926; USA; DA. 1982; VOL. 11; NO 16; PP. 1793-1807; BIBL. 3 P.Article

A GENERALIZATION OF THE BCH BOUND FOR CYCLIC CODES, INCLUDING THE HARTMANN-TZENG BOUNDROOS C.1982; J. COMB. THEORY, SER. A; ISSN 0097-3165; USA; DA. 1982; VOL. 33; NO 2; PP. 229-232; BIBL. 4 REF.Article

HOW TO COMPUTE THE MINIMUM DISTANCE FOR CYCLIC AN-CODES OVER AN ARBITRARY BASE. I: ELEMENTARY METHODSECKER A.1980; INFORM. CONTROL; ISSN 0019-9958; USA; DA. 1980; VOL. 46; NO 3; PP. 219-240; BIBL. 21 REF.Article

MINIMUM DISTANCE AND ROBUST ESTIMATIONPARR WC; SCHUCANY WR.1980; J. AM. STAT. ASSOC.; ISSN 0003-1291; USA; DA. 1980; VOL. 75; NO 371; PP. 616-624; BIBL. 28 REF.Article

THE MINIMUM DISTANCE METHOD OF TESTINGPOLLARD D.1980; METRIKA; DEU; DA. 1980; VOL. 27; NO 1; PP. 43-70; BIBL. 36 REF.Article

CODES EN BLOCS BINAIRES SATISFAISANT A UNE MATRICE DE DISTANCES MINIMALES DONNEEKISOV VT; DIMOV DT.1979; PROBL. CONTROL INFORM. THEORY; HUN; DA. 1979; VOL. 8; NO 5-6; PP. 403-420; ABS. ENG; BIBL. 5 REF.Article

INDEPENDENT PAIRS OF GOOD SELF-DUAL CODESKANTOR WA.1982; IEEE TRANSACTIONS ON INFORMATION THEORY; ISSN 0018-9448; USA; DA. 1982; VOL. 28; NO 6; PP. 966-967; BIBL. 6 REF.Article

  • Page / 43